Virtual Chunks: Enabling Random Accesses to Compressed Data
نویسنده
چکیده
My research interests span the areas of big data, cloud computing, high-performance computing, and machine intelligence. A common thread in my research is the orchestration of both theories and systems: An in-depth theoretical analysis is conducted to guide the design and implementation of the real system; On the other hand, from building real systems I abstract their commonality to achieve general research insight. The remainder of this document will brief three representative works followed by one of my future research directions.
منابع مشابه
Editorial Preface: Special Issue on Big Data Analytics, Infrastructure, and Applications
THE pervasive nature of digital technologies as witnessed in industry, services and everyday life has given rise to an emergent, data-focused economy stemming from many aspects of human individual and commercial activity. The richness and vastness of these data are creating unprecedented research opportunities in a number of fields including urban studies, geography, economics, finance, and soc...
متن کاملAccelerating Magnetic Resonance Imaging through Compressed Sensing Theory in the Direction space-k
Magnetic Resonance Imaging (MRI) is a noninvasive imaging method widely used in medical diagnosis. Data in MRI are obtained line-by-line within the K-space, where there are usually a great number of such lines. For this reason, magnetic resonance imaging is slow. MRI can be accelerated through several methods such as parallel imaging and compressed sensing, where a fraction of the K-space lines...
متن کاملA Block-Wise random sampling approach: Compressed sensing problem
The focus of this paper is to consider the compressed sensing problem. It is stated that the compressed sensing theory, under certain conditions, helps relax the Nyquist sampling theory and takes smaller samples. One of the important tasks in this theory is to carefully design measurement matrix (sampling operator). Most existing methods in the literature attempt to optimize a randomly initiali...
متن کاملThe Case for Compressed Caching in Virtual Memory Systems
Compressed caching uses part of the available RAM to hold pages in compressed form, effectively adding a new level to the virtual memory hierarchy. This level attempts to bridge the huge performance gap between normal (uncompressed) RAM and disk. Unfortunately, previous studies did not show a consistent benefit from the use of compressed virtual memory. In this study, we show that technology tr...
متن کاملApproximate String Matching with Compressed Indexes
A compressed full-text self-index for a text T is a data structure requiring reduced space and able to search for patterns P in T . It can also reproduce any substring of T , thus actually replacing T . Despite the recent explosion of interest on compressed indexes, there has not been much progress on functionalities beyond the basic exact search. In this paper we focus on indexed approximate s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015